|
The Leonardo numbers are a sequence of numbers given by the recurrence: : Edsger W. Dijkstra〔(EWD797 )〕 used them as an integral part of his smoothsort algorithm, and also analyzed them in some detail.〔(EWD796a )〕 Computing a second-order recurrence relation recursively and without memoization requires L(n) computations for the ''n''-th item of the series. ==Relation to Fibonacci numbers== The Leonardo numbers are related to the Fibonacci numbers by the relation . From this relation it is straightforward to derive a closed-form expression for the Leonardo numbers, analogous to Binet's formula for the Fibonacci numbers: : where the golden ratio and are the roots of the quadratic polynomial . The first few Leonardo numbers are : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Leonardo number」の詳細全文を読む スポンサード リンク
|